<!-- This comment will put IE 6, 7 and 8 in quirks mode -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>include/shark/Models/Trees/BinaryTree.h Source File</title>
<script type="text/javaScript" src="search/search.js"></script>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script src="https://polyfill.io/v3/polyfill.min.js?features=es6"></script>
<script id="MathJax-script" async src="https://cdn.jsdelivr.net/npm/mathjax@3.0.1/es5/tex-mml-chtml.js"></script>
<script src="../../mlstyle.js"></script>
<link href="../css/besser.css" rel="stylesheet" type="text/css"/>
</head>
<!-- pretty cool: each body gets an id tag which is the basename of the web page  -->
<!--              and allows for page-specific CSS. this is client-side scripted, -->
<!--              so the id will not yet show up in the served source code -->
<script type="text/javascript">
    jQuery(document).ready(function () {
        var url = jQuery(location).attr('href');
        var pname = url.substr(url.lastIndexOf("/")+1, url.lastIndexOf(".")-url.lastIndexOf("/")-1);
        jQuery('#this_url').html('<strong>' + pname + '</strong>');
        jQuery('body').attr('id', pname);
    });
</script>
<body>
    <div id="shark_old">
        <div id="wrap">
            <div id="header">
                <div id="site-name"><a href="../../sphinx_pages/build/html/index.html">Shark machine learning library</a></div>
                <ul id="nav">
                    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/installation.html">Installation</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/tutorials/tutorials.html">Tutorials</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/benchmark.html">Benchmarks</a>
                    </li>
                    <li class="active">
                        <a href="classes.html">Documentation</a>
                        <ul>
                            <li class="first"></li>
                            <li><a href="../../sphinx_pages/build/html/rest_sources/quickref/quickref.html">Quick references</a></li>
                            <li><a href="classes.html">Class list</a></li>
                            <li class="last"><a href="group__shark__globals.html">Global functions</a></li>
                        </ul>
                    </li>
                </ul>
            </div>
        </div>
    </div>
<div id="doxywrapper">
<!--
    <div id="global_doxytitle">Doxygen<br>Documentation:</div>
-->
    <div id="navrow_wrapper">
<!-- Generated by Doxygen 1.9.8 -->
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_9d0c4981f10d03078bcfd5c74fe41ce8.html">shark</a></li><li class="navelem"><a class="el" href="dir_d88670438e31f34fbe7ccda1c525ad9e.html">Models</a></li><li class="navelem"><a class="el" href="dir_e4d868c139b0b9f3574e13422955c5bc.html">Trees</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle"><div class="title">BinaryTree.h</div></div>
</div><!--header-->
<div class="contents">
<a href="_binary_tree_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">//===========================================================================</span><span class="comment"></span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">/*!</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * </span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * \file</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * \brief       Binary space-partitioning tree of data points.</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * </span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * </span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> *</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * \author      T. Glasmachers</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * \date        2011</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> *</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> *</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> * \par Copyright 1995-2017 Shark Development Team</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> * </span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> * &lt;BR&gt;&lt;HR&gt;</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> * This file is part of Shark.</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> * &lt;https://shark-ml.github.io/Shark/&gt;</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> * </span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> * Shark is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> * it under the terms of the GNU Lesser General Public License as published </span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * by the Free Software Foundation, either version 3 of the License, or</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> * </span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> * Shark is distributed in the hope that it will be useful,</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> * GNU Lesser General Public License for more details.</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"> * </span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"> * You should have received a copy of the GNU Lesser General Public License</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> * along with Shark.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment"> *</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment"> */</span></div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment">//===========================================================================</span></div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#ifndef SHARK_ALGORITHMS_NEARESTNEIGHBORS_BINARYTREE_H</span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#define SHARK_ALGORITHMS_NEARESTNEIGHBORS_BINARYTREE_H</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;<a class="code" href="_exception_8h.html">shark/Core/Exception.h</a>&gt;</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;<a class="code" href="functional_8h.html">shark/Core/utility/functional.h</a>&gt;</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;<a class="code" href="_key_value_pair_8h.html">shark/Core/utility/KeyValuePair.h</a>&gt;</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;<a class="code" href="_abstract_kernel_function_8h.html" title="abstract super class of all kernel functions">shark/Models/Kernels/AbstractKernelFunction.h</a>&gt;</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#include &lt;boost/range/algorithm_ext/iota.hpp&gt;</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &lt;boost/range/iterator_range.hpp&gt;</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#include &lt;boost/math/special_functions/fpclassify.hpp&gt;</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceshark.html" title="AbstractMultiObjectiveOptimizer.">shark</a> {</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    </div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="comment"></span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment">/// \defgroup space_trees Space Partitioning Trees</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="comment">/// \ingroup models</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment">///</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment">/// Space partitioning trees in shark used for quick lookup of points in a low-dimensional space.</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="comment">/// They are no model, but important building blocks, for example for nearest neighbour or clustering algorithms.</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="comment"></span> </div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="comment"></span> </div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="comment">/// \brief Stopping criteria for tree construction.</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="comment">///</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="comment">/// \par</span></div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="comment">/// Conditions for automatic tree construction.</span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="comment">/// The data structure allows to specify a maximum</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment">/// bucket size (number of instances represented</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="comment">/// by a leaf), and a maximum tree depth.</span></div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="comment">///</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="comment">/// \par</span></div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="comment">/// Note: If a data instance appears more often in</span></div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment">/// a dataset than specified by the maximum bucket</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment">/// size then this condition will be violated; this</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment">/// is because a space partitioning tree has no</span></div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="comment">/// means of separating a single point.</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="comment">///</span></div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment">/// \ingroup space_trees</span></div>
<div class="foldopen" id="foldopen00073" data-start="{" data-end="};">
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_construction.html">   73</a></span><span class="comment"></span><span class="keyword">class </span><a class="code hl_class" href="classshark_1_1_tree_construction.html" title="Stopping criteria for tree construction.">TreeConstruction</a></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>{</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="keyword">public</span>:<span class="comment"></span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="comment">    /// \brief Default constructor: only stop at trivial leaves</span></div>
<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_construction.html#a59a1339479147eec5ea8c780a4cf6ddc">   77</a></span><span class="comment"></span>    <a class="code hl_function" href="classshark_1_1_tree_construction.html#a59a1339479147eec5ea8c780a4cf6ddc" title="Default constructor: only stop at trivial leaves.">TreeConstruction</a>()</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    : <a class="code hl_variable" href="classshark_1_1_tree_construction.html#a4631c3ae5ba78df8b954963e4be22e45" title="maximum depth of the tree">m_maxDepth</a>(0xffffffff)</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    , <a class="code hl_variable" href="classshark_1_1_tree_construction.html#a46b8dd6388568e3e101435c8cdf0efd4" title="maximum &quot;size&quot; of a leaf node">m_maxBucketSize</a>(1)</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    { }</div>
</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="comment"></span> </div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="comment">    /// \brief Copy constructor.</span></div>
<div class="foldopen" id="foldopen00083" data-start="{" data-end="}">
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_construction.html#ab58da7392a7140a4a51302ab34815172">   83</a></span><span class="comment"></span>    <a class="code hl_function" href="classshark_1_1_tree_construction.html#ab58da7392a7140a4a51302ab34815172" title="Copy constructor.">TreeConstruction</a>(<a class="code hl_class" href="classshark_1_1_tree_construction.html" title="Stopping criteria for tree construction.">TreeConstruction</a> <span class="keyword">const</span>&amp; other)</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    : <a class="code hl_variable" href="classshark_1_1_tree_construction.html#a4631c3ae5ba78df8b954963e4be22e45" title="maximum depth of the tree">m_maxDepth</a>(other.<a class="code hl_variable" href="classshark_1_1_tree_construction.html#a4631c3ae5ba78df8b954963e4be22e45" title="maximum depth of the tree">m_maxDepth</a>)</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    , <a class="code hl_variable" href="classshark_1_1_tree_construction.html#a46b8dd6388568e3e101435c8cdf0efd4" title="maximum &quot;size&quot; of a leaf node">m_maxBucketSize</a>(other.<a class="code hl_variable" href="classshark_1_1_tree_construction.html#a46b8dd6388568e3e101435c8cdf0efd4" title="maximum &quot;size&quot; of a leaf node">m_maxBucketSize</a>)</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    { }</div>
</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span><span class="comment"></span> </div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="comment">    /// \brief Constructor.</span></div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="comment">    ///</span></div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="comment">    /// \param  maxDepth       stop as soon as the given tree depth is reached (zero means unrestricted)</span></div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="comment">    /// \param  maxBucketSize  stop as soon as a node holds at most the bucket size of data points (zero means unrestricted)</span></div>
<div class="foldopen" id="foldopen00092" data-start="{" data-end="}">
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_construction.html#adbbd4f3b18ceca7fa693f166a3066daf">   92</a></span><span class="comment"></span>    <a class="code hl_function" href="classshark_1_1_tree_construction.html#adbbd4f3b18ceca7fa693f166a3066daf" title="Constructor.">TreeConstruction</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classshark_1_1_tree_construction.html#abb2b42865b60ddf110e4915ab6457373" title="return maximum depth of the tree">maxDepth</a>, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classshark_1_1_tree_construction.html#aa1b255097aa1e7101783b1300b921aad" title="return maximum &quot;size&quot; of a leaf node">maxBucketSize</a>)</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    : <a class="code hl_variable" href="classshark_1_1_tree_construction.html#a4631c3ae5ba78df8b954963e4be22e45" title="maximum depth of the tree">m_maxDepth</a>(<a class="code hl_function" href="classshark_1_1_tree_construction.html#abb2b42865b60ddf110e4915ab6457373" title="return maximum depth of the tree">maxDepth</a> ? <a class="code hl_function" href="classshark_1_1_tree_construction.html#abb2b42865b60ddf110e4915ab6457373" title="return maximum depth of the tree">maxDepth</a> : 0xffffffff)</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    , <a class="code hl_variable" href="classshark_1_1_tree_construction.html#a46b8dd6388568e3e101435c8cdf0efd4" title="maximum &quot;size&quot; of a leaf node">m_maxBucketSize</a>(<a class="code hl_function" href="classshark_1_1_tree_construction.html#aa1b255097aa1e7101783b1300b921aad" title="return maximum &quot;size&quot; of a leaf node">maxBucketSize</a> ? <a class="code hl_function" href="classshark_1_1_tree_construction.html#aa1b255097aa1e7101783b1300b921aad" title="return maximum &quot;size&quot; of a leaf node">maxBucketSize</a> : 1)</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    { }</div>
</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="comment"></span> </div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="comment">    /// return a TreeConstruction object with maxDepth reduced by one</span></div>
<div class="foldopen" id="foldopen00099" data-start="{" data-end="}">
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_construction.html#aa76f09fabb33889421b6c8f2771afb8a">   99</a></span><span class="comment"></span>    <a class="code hl_class" href="classshark_1_1_tree_construction.html" title="Stopping criteria for tree construction.">TreeConstruction</a> <a class="code hl_function" href="classshark_1_1_tree_construction.html#aa76f09fabb33889421b6c8f2771afb8a" title="return a TreeConstruction object with maxDepth reduced by one">nextDepthLevel</a>()<span class="keyword"> const</span></div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="classshark_1_1_tree_construction.html#a59a1339479147eec5ea8c780a4cf6ddc" title="Default constructor: only stop at trivial leaves.">TreeConstruction</a>(<a class="code hl_variable" href="classshark_1_1_tree_construction.html#a4631c3ae5ba78df8b954963e4be22e45" title="maximum depth of the tree">m_maxDepth</a> - 1, <a class="code hl_variable" href="classshark_1_1_tree_construction.html#a46b8dd6388568e3e101435c8cdf0efd4" title="maximum &quot;size&quot; of a leaf node">m_maxBucketSize</a>); }</div>
</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="comment"></span> </div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span><span class="comment">    /// return maximum depth of the tree</span></div>
<div class="foldopen" id="foldopen00104" data-start="{" data-end="}">
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_construction.html#abb2b42865b60ddf110e4915ab6457373">  104</a></span><span class="comment"></span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classshark_1_1_tree_construction.html#abb2b42865b60ddf110e4915ab6457373" title="return maximum depth of the tree">maxDepth</a>()<span class="keyword"> const</span></div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="classshark_1_1_tree_construction.html#a4631c3ae5ba78df8b954963e4be22e45" title="maximum depth of the tree">m_maxDepth</a>; }</div>
</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span><span class="comment"></span> </div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span><span class="comment">    /// return maximum &quot;size&quot; of a leaf node</span></div>
<div class="foldopen" id="foldopen00108" data-start="{" data-end="}">
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_construction.html#aa1b255097aa1e7101783b1300b921aad">  108</a></span><span class="comment"></span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classshark_1_1_tree_construction.html#aa1b255097aa1e7101783b1300b921aad" title="return maximum &quot;size&quot; of a leaf node">maxBucketSize</a>()<span class="keyword"> const</span></div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="classshark_1_1_tree_construction.html#a46b8dd6388568e3e101435c8cdf0efd4" title="maximum &quot;size&quot; of a leaf node">m_maxBucketSize</a>; }</div>
</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span><span class="keyword">protected</span>:<span class="comment"></span></div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="comment">    /// maximum depth of the tree</span></div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_construction.html#a4631c3ae5ba78df8b954963e4be22e45">  113</a></span><span class="comment"></span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="classshark_1_1_tree_construction.html#a4631c3ae5ba78df8b954963e4be22e45" title="maximum depth of the tree">m_maxDepth</a>;</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span><span class="comment"></span> </div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span><span class="comment">    /// maximum &quot;size&quot; of a leaf node</span></div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_construction.html#a46b8dd6388568e3e101435c8cdf0efd4">  116</a></span><span class="comment"></span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="classshark_1_1_tree_construction.html#a46b8dd6388568e3e101435c8cdf0efd4" title="maximum &quot;size&quot; of a leaf node">m_maxBucketSize</a>;</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>};</div>
</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span><span class="comment"></span> </div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="comment">///</span></div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="comment">/// \brief Super class of binary space-partitioning trees.</span></div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span><span class="comment">///</span></div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="comment">/// \par</span></div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span><span class="comment">/// This class represents a generic node in a binary</span></div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span><span class="comment">/// space-partitioning tree. At each junction the</span></div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span><span class="comment">/// space cell represented by the parent node is</span></div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="comment">/// split into sub-cells by thresholding a real-valued</span></div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span><span class="comment">/// function. Different sub-classes implement different</span></div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="comment">/// such functions. The absolute value of the function</span></div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span><span class="comment">/// minus the threshold m_threshold must represent the</span></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="comment">/// distance to the separating hyper-surface in the</span></div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="comment">/// underlying metric. This allows for linear separation,</span></div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="comment">/// but also for kernel-induced feature spaces and other</span></div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="comment">/// embeddings.</span></div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span><span class="comment">/// \ingroup space_trees</span></div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span><span class="comment"></span><span class="keyword">template</span> &lt;<span class="keyword">class</span> InputT&gt;</div>
<div class="foldopen" id="foldopen00137" data-start="{" data-end="};">
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html">  137</a></span><span class="keyword">class </span><a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree</a></div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>{</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keyword">typedef</span> InputT value_type;</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span><span class="comment"></span> </div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span><span class="comment">    /// \brief Root node constructor: build the tree from data.</span></div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="comment">    ///</span></div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="comment">    /// Please refer the specific sub-classes such as KDTree</span></div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span><span class="comment">    /// for examples of how the binary tree is built.</span></div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span><span class="comment">    ///</span></div>
<div class="foldopen" id="foldopen00147" data-start="{" data-end="}">
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a50b781f4203ea4d3a9e1dc60a52bec4e">  147</a></span><span class="comment"></span>    <a class="code hl_function" href="classshark_1_1_binary_tree.html#a50b781f4203ea4d3a9e1dc60a52bec4e" title="Root node constructor: build the tree from data.">BinaryTree</a>(std::size_t <a class="code hl_function" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662" title="number of points inside the space represented by this node">size</a>)</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    : <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a100ef54d8a4904afff8c188bf4e735f9" title="parent node">mep_parent</a>(NULL)</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    , <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0" title="&quot;left&quot; child node">mp_left</a>(NULL)</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    , <a class="code hl_variable" href="classshark_1_1_binary_tree.html#acc95bb731d3bfac4a896820f8de04ad8" title="&quot;right&quot; child node">mp_right</a>(NULL)</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    , <a class="code hl_variable" href="classshark_1_1_binary_tree.html#afdce442d41868d9a84dcfc954c78ce93" title="list of indices to points in the dataset">mp_indexList</a>(NULL)</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    , <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a>(<a class="code hl_function" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662" title="number of points inside the space represented by this node">size</a>)</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    , <a class="code hl_variable" href="classshark_1_1_binary_tree.html#ad07d8f306001f8e1bc9a321a3d11444e" title="number of nodes in the sub-tree represented by this node">m_nodes</a>(0)</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    , <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a1d2b86563df35585acbbb0364d3a7450" title="threshold for the separating function">m_threshold</a>(0.0)</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    {</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        <a class="code hl_define" href="_exception_8h.html#a73abb5049a0168d72a48e72dda41708b">SHARK_ASSERT</a>(<a class="code hl_variable" href="classshark_1_1_binary_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a> &gt; 0);</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        <span class="comment">// prepare list of index/pointer pairs to be shared among the whole tree</span></div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <a class="code hl_variable" href="classshark_1_1_binary_tree.html#afdce442d41868d9a84dcfc954c78ce93" title="list of indices to points in the dataset">mp_indexList</a> = <span class="keyword">new</span> std::size_t[<a class="code hl_variable" href="classshark_1_1_binary_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a>];</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        std::iota(<a class="code hl_variable" href="classshark_1_1_binary_tree.html#afdce442d41868d9a84dcfc954c78ce93" title="list of indices to points in the dataset">mp_indexList</a>,<a class="code hl_variable" href="classshark_1_1_binary_tree.html#afdce442d41868d9a84dcfc954c78ce93" title="list of indices to points in the dataset">mp_indexList</a>+<a class="code hl_variable" href="classshark_1_1_binary_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a>,0);</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    }</div>
</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span><span class="comment"></span> </div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span><span class="comment">    /// Destroy the tree and its internal data structures</span></div>
<div class="foldopen" id="foldopen00164" data-start="{" data-end="}">
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a9928e5dcb0026028ef3f4cbf56fe8721">  164</a></span><span class="comment"></span>    <span class="keyword">virtual</span> <a class="code hl_function" href="classshark_1_1_binary_tree.html#a9928e5dcb0026028ef3f4cbf56fe8721" title="Destroy the tree and its internal data structures.">~BinaryTree</a>()</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    {</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classshark_1_1_binary_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0" title="&quot;left&quot; child node">mp_left</a> != NULL) <span class="keyword">delete</span> <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0" title="&quot;left&quot; child node">mp_left</a>;</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classshark_1_1_binary_tree.html#acc95bb731d3bfac4a896820f8de04ad8" title="&quot;right&quot; child node">mp_right</a> != NULL) <span class="keyword">delete</span> <a class="code hl_variable" href="classshark_1_1_binary_tree.html#acc95bb731d3bfac4a896820f8de04ad8" title="&quot;right&quot; child node">mp_right</a>;</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classshark_1_1_binary_tree.html#a100ef54d8a4904afff8c188bf4e735f9" title="parent node">mep_parent</a> == NULL) <span class="keyword">delete</span> [] <a class="code hl_variable" href="classshark_1_1_binary_tree.html#afdce442d41868d9a84dcfc954c78ce93" title="list of indices to points in the dataset">mp_indexList</a>;</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    }</div>
</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span> </div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="comment">// binary tree structure</span></div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span><span class="comment"></span> </div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span><span class="comment">    /// parent node</span></div>
<div class="foldopen" id="foldopen00175" data-start="{" data-end="}">
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a86cc7ef0387f9ae7cb4aff75cf4c6bee">  175</a></span><span class="comment"></span>    <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree</a>* <a class="code hl_function" href="classshark_1_1_binary_tree.html#a86cc7ef0387f9ae7cb4aff75cf4c6bee" title="parent node">parent</a>()</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    { <span class="keywordflow">return</span> <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a100ef54d8a4904afff8c188bf4e735f9" title="parent node">mep_parent</a>; }<span class="comment"></span></div>
</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span><span class="comment">    /// parent node</span></div>
<div class="foldopen" id="foldopen00178" data-start="{" data-end="}">
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#acf31280508b15cf67be7b7b4d30e41f5">  178</a></span><span class="comment"></span>    <span class="keyword">const</span> <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree</a>* <a class="code hl_function" href="classshark_1_1_binary_tree.html#acf31280508b15cf67be7b7b4d30e41f5" title="parent node">parent</a>()<span class="keyword"> const</span></div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a100ef54d8a4904afff8c188bf4e735f9" title="parent node">mep_parent</a>; }</div>
</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span><span class="comment"></span> </div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span><span class="comment">    /// Does this node have children?</span></div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span><span class="comment">    /// Opposite of isLeaf()</span></div>
<div class="foldopen" id="foldopen00183" data-start="{" data-end="}">
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a8d5379344624257a1c2950d4e64ab8c0">  183</a></span><span class="comment"></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="classshark_1_1_binary_tree.html#a8d5379344624257a1c2950d4e64ab8c0">hasChildren</a>()<span class="keyword"> const</span></div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> (<a class="code hl_variable" href="classshark_1_1_binary_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0" title="&quot;left&quot; child node">mp_left</a> != NULL); }</div>
</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span><span class="comment"></span> </div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span><span class="comment">    /// Is this a leaf node?</span></div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span><span class="comment">    /// Opposite of hasChildren()</span></div>
<div class="foldopen" id="foldopen00188" data-start="{" data-end="}">
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a1876569a27c34141bbc4e3fbfe2367ef">  188</a></span><span class="comment"></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="classshark_1_1_binary_tree.html#a1876569a27c34141bbc4e3fbfe2367ef">isLeaf</a>()<span class="keyword"> const</span></div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> (<a class="code hl_variable" href="classshark_1_1_binary_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0" title="&quot;left&quot; child node">mp_left</a> == NULL); }</div>
</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span><span class="comment"></span> </div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span><span class="comment">    /// &quot;left&quot; sub-node of the binary tree</span></div>
<div class="foldopen" id="foldopen00192" data-start="{" data-end="}">
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#ae20385cf5cf85d7168db9b3fcf411c47">  192</a></span><span class="comment"></span>    <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree</a>* <a class="code hl_function" href="classshark_1_1_binary_tree.html#ae20385cf5cf85d7168db9b3fcf411c47" title="&quot;left&quot; sub-node of the binary tree">left</a>()</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    { <span class="keywordflow">return</span> <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0" title="&quot;left&quot; child node">mp_left</a>; }<span class="comment"></span></div>
</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span><span class="comment">    /// &quot;left&quot; sub-node of the binary tree</span></div>
<div class="foldopen" id="foldopen00195" data-start="{" data-end="}">
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a3b130767c5ff7c5233b0de89fb263221">  195</a></span><span class="comment"></span>    <span class="keyword">const</span> <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree</a>* <a class="code hl_function" href="classshark_1_1_binary_tree.html#a3b130767c5ff7c5233b0de89fb263221" title="&quot;left&quot; sub-node of the binary tree">left</a>()<span class="keyword"> const</span></div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0" title="&quot;left&quot; child node">mp_left</a>; }</div>
</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span><span class="comment"></span> </div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span><span class="comment">    /// &quot;right&quot; sub-node of the binary tree</span></div>
<div class="foldopen" id="foldopen00199" data-start="{" data-end="}">
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#ae5167564abb964d90da01897693a5768">  199</a></span><span class="comment"></span>    <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree</a>* <a class="code hl_function" href="classshark_1_1_binary_tree.html#ae5167564abb964d90da01897693a5768" title="&quot;right&quot; sub-node of the binary tree">right</a>()</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    { <span class="keywordflow">return</span> <a class="code hl_variable" href="classshark_1_1_binary_tree.html#acc95bb731d3bfac4a896820f8de04ad8" title="&quot;right&quot; child node">mp_right</a>; }<span class="comment"></span></div>
</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span><span class="comment">    /// &quot;right&quot; sub-node of the binary tree</span></div>
<div class="foldopen" id="foldopen00202" data-start="{" data-end="}">
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a57a5c5fd47bda6d5fc35774abfb9731f">  202</a></span><span class="comment"></span>    <span class="keyword">const</span> <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree</a>* <a class="code hl_function" href="classshark_1_1_binary_tree.html#a57a5c5fd47bda6d5fc35774abfb9731f" title="&quot;right&quot; sub-node of the binary tree">right</a>()<span class="keyword"> const</span></div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="classshark_1_1_binary_tree.html#acc95bb731d3bfac4a896820f8de04ad8" title="&quot;right&quot; child node">mp_right</a>; }</div>
</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span><span class="comment"></span> </div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span><span class="comment">    /// number of points inside the space represented by this node</span></div>
<div class="foldopen" id="foldopen00206" data-start="{" data-end="}">
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662">  206</a></span><span class="comment"></span>    std::size_t <a class="code hl_function" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662" title="number of points inside the space represented by this node">size</a>()<span class="keyword"> const</span></div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a>; }</div>
</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span><span class="comment"></span> </div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span><span class="comment">    /// number of sub-nodes in this tree (including the node itself)</span></div>
<div class="foldopen" id="foldopen00210" data-start="{" data-end="}">
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a53cb65296bf84a1fbe0715e2ba0878bb">  210</a></span><span class="comment"></span>    std::size_t <a class="code hl_function" href="classshark_1_1_binary_tree.html#a53cb65296bf84a1fbe0715e2ba0878bb" title="number of sub-nodes in this tree (including the node itself)">nodes</a>()<span class="keyword"> const</span></div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="classshark_1_1_binary_tree.html#ad07d8f306001f8e1bc9a321a3d11444e" title="number of nodes in the sub-tree represented by this node">m_nodes</a>; }</div>
</div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span> </div>
<div class="foldopen" id="foldopen00213" data-start="{" data-end="}">
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#ac499a09353aff38530837d22a16ad24a">  213</a></span>    std::size_t <a class="code hl_function" href="classshark_1_1_binary_tree.html#ac499a09353aff38530837d22a16ad24a">index</a>(std::size_t point)<span class="keyword">const</span>{</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="classshark_1_1_binary_tree.html#afdce442d41868d9a84dcfc954c78ce93" title="list of indices to points in the dataset">mp_indexList</a>[point];</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    }</div>
</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span> </div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <span class="comment">// partition represented by this node</span></div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span><span class="comment"></span> </div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span><span class="comment">    /// \brief Function describing the separation of space.</span></div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span><span class="comment">    ///</span></div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span><span class="comment">    /// \par</span></div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span><span class="comment">    /// This function is shifted by subtracting the</span></div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span><span class="comment">    /// threshold from the virtual function &quot;funct&quot; (which</span></div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span><span class="comment">    /// acts as a &quot;decision&quot; function to split space into</span></div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span><span class="comment">    /// sub-cells).</span></div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span><span class="comment">    /// The result of this function describes &quot;signed&quot;</span></div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span><span class="comment">    /// distance to the separation boundary, and the two</span></div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span><span class="comment">    /// cells are thresholded at zero. We obtain the two</span></div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span><span class="comment">    /// cells:&lt;br/&gt;</span></div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span><span class="comment">    /// left (&quot;negative&quot;) cell: {x | distance(x) &lt; 0}&lt;br/&gt;</span></div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span><span class="comment">    /// right (&quot;positive&quot;) cell {x | distance(x) &gt;= 0}</span></div>
<div class="foldopen" id="foldopen00233" data-start="{" data-end="}">
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#aa0d859e272e40b522cb3eb328b0e1f41">  233</a></span><span class="comment"></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="classshark_1_1_binary_tree.html#aa0d859e272e40b522cb3eb328b0e1f41" title="Function describing the separation of space.">distanceFromPlane</a>(value_type <span class="keyword">const</span>&amp; point)<span class="keyword"> const</span>{</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="classshark_1_1_binary_tree.html#ad3bf9775a2e3122973a1b4036e8854fd" title="Function describing the separation of space.">funct</a>(point) - <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a1d2b86563df35585acbbb0364d3a7450" title="threshold for the separating function">m_threshold</a>;</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    }</div>
</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span><span class="comment"></span> </div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span><span class="comment">    /// \brief Separation threshold.</span></div>
<div class="foldopen" id="foldopen00238" data-start="{" data-end="}">
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#ad7e43f9fa135d67d1817b2a7aa20b434">  238</a></span><span class="comment"></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="classshark_1_1_binary_tree.html#ad7e43f9fa135d67d1817b2a7aa20b434" title="Separation threshold.">threshold</a>()<span class="keyword"> const</span>{</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a1d2b86563df35585acbbb0364d3a7450" title="threshold for the separating function">m_threshold</a>;</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    }</div>
</div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span><span class="comment"></span> </div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span><span class="comment">    /// return true if the reference point belongs to the</span></div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span><span class="comment">    /// &quot;left&quot; sub-node, or to the &quot;negative&quot; sub-cell.</span></div>
<div class="foldopen" id="foldopen00244" data-start="{" data-end="}">
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a456c9994792021b1bb2557cad4ab7a3e">  244</a></span><span class="comment"></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="classshark_1_1_binary_tree.html#a456c9994792021b1bb2557cad4ab7a3e">isLeft</a>(value_type <span class="keyword">const</span>&amp; point)<span class="keyword"> const</span></div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> (<a class="code hl_function" href="classshark_1_1_binary_tree.html#ad3bf9775a2e3122973a1b4036e8854fd" title="Function describing the separation of space.">funct</a>(point) &lt; <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a1d2b86563df35585acbbb0364d3a7450" title="threshold for the separating function">m_threshold</a>); }</div>
</div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span><span class="comment"></span> </div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span><span class="comment">    /// return true if the reference point belongs to the</span></div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span><span class="comment">    /// &quot;right&quot; sub-node, or to the &quot;positive&quot; sub-cell.</span></div>
<div class="foldopen" id="foldopen00249" data-start="{" data-end="}">
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#aaf824c0062811dfa4311a66292bb38be">  249</a></span><span class="comment"></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="classshark_1_1_binary_tree.html#aaf824c0062811dfa4311a66292bb38be">isRight</a>(value_type <span class="keyword">const</span>&amp; point)<span class="keyword"> const</span></div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span><span class="keyword">    </span>{ <span class="keywordflow">return</span> (<a class="code hl_function" href="classshark_1_1_binary_tree.html#ad3bf9775a2e3122973a1b4036e8854fd" title="Function describing the separation of space.">funct</a>(point) &gt;= <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a1d2b86563df35585acbbb0364d3a7450" title="threshold for the separating function">m_threshold</a>); }</div>
</div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span><span class="comment"></span> </div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span><span class="comment">    /// \brief If the tree uses a kernel metric, returns a pointer to the kernel object, else NULL.</span></div>
<div class="foldopen" id="foldopen00253" data-start="{" data-end="}">
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a882ac1aea537378fead318573c9b301c">  253</a></span><span class="comment"></span>    <span class="keyword">virtual</span> <a class="code hl_class" href="classshark_1_1_abstract_kernel_function.html" title="Base class of all Kernel functions.">AbstractKernelFunction&lt;value_type&gt;</a> <span class="keyword">const</span>* <a class="code hl_function" href="classshark_1_1_binary_tree.html#a882ac1aea537378fead318573c9b301c" title="If the tree uses a kernel metric, returns a pointer to the kernel object, else NULL.">kernel</a>()<span class="keyword">const</span>{</div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>        <span class="comment">//default is no kernel metric</span></div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>        <span class="keywordflow">return</span> NULL;</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    }</div>
</div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span> </div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span><span class="comment"></span> </div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span><span class="comment">    /// \brief Compute lower bound on the squared distance to the space cell.</span></div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span><span class="comment">    ///</span></div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span><span class="comment">    /// \par</span></div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span><span class="comment">    /// For efficient use of the triangle inequality</span></div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span><span class="comment">    /// the space cell represented by each node needs</span></div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span><span class="comment">    /// to provide (a lower bound on) the distance of</span></div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span><span class="comment">    /// a query point to the space cell represented by</span></div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span><span class="comment">    /// this node. Search is fast if this bound is</span></div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span><span class="comment">    /// tight.</span></div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#aa78235225476effa7b22d285f3d9e197">  268</a></span><span class="comment"></span>    <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code hl_function" href="classshark_1_1_binary_tree.html#aa78235225476effa7b22d285f3d9e197" title="Compute lower bound on the squared distance to the space cell.">squaredDistanceLowerBound</a>(value_type <span class="keyword">const</span>&amp; point) <span class="keyword">const</span> = 0;</div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span> </div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span><span class="keyword">protected</span>:<span class="comment"></span></div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span><span class="comment">    /// \brief Sub-node constructor</span></div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span><span class="comment">    ///</span></div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span><span class="comment">    /// \par</span></div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span><span class="comment">    /// Initialize a sub-node</span></div>
<div class="foldopen" id="foldopen00275" data-start="{" data-end="}">
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#ac92e6cbbc2318f60cf32112bf640138e">  275</a></span><span class="comment"></span>    <a class="code hl_function" href="classshark_1_1_binary_tree.html#ac92e6cbbc2318f60cf32112bf640138e" title="Sub-node constructor.">BinaryTree</a>(<a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree</a>* <a class="code hl_function" href="classshark_1_1_binary_tree.html#a86cc7ef0387f9ae7cb4aff75cf4c6bee" title="parent node">parent</a>, std::size_t* list, std::size_t <a class="code hl_function" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662" title="number of points inside the space represented by this node">size</a>)</div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    : <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a100ef54d8a4904afff8c188bf4e735f9" title="parent node">mep_parent</a>(<a class="code hl_function" href="classshark_1_1_binary_tree.html#a86cc7ef0387f9ae7cb4aff75cf4c6bee" title="parent node">parent</a>)</div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    , <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0" title="&quot;left&quot; child node">mp_left</a>(NULL)</div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    , <a class="code hl_variable" href="classshark_1_1_binary_tree.html#acc95bb731d3bfac4a896820f8de04ad8" title="&quot;right&quot; child node">mp_right</a>(NULL)</div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    , <a class="code hl_variable" href="classshark_1_1_binary_tree.html#afdce442d41868d9a84dcfc954c78ce93" title="list of indices to points in the dataset">mp_indexList</a>(list)</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    , <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a>(<a class="code hl_function" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662" title="number of points inside the space represented by this node">size</a>)</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    , <a class="code hl_variable" href="classshark_1_1_binary_tree.html#ad07d8f306001f8e1bc9a321a3d11444e" title="number of nodes in the sub-tree represented by this node">m_nodes</a>(0)</div>
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>    {}</div>
</div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span> </div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span><span class="comment"></span> </div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span><span class="comment">    /// \brief Function describing the separation of space.</span></div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span><span class="comment">    ///</span></div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span><span class="comment">    /// \par</span></div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span><span class="comment">    /// This is the primary interface for customizing</span></div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span><span class="comment">    /// sub-classes.</span></div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span><span class="comment">    ///</span></div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span><span class="comment">    /// \par</span></div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span><span class="comment">    /// This function splits the space represented by the</span></div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span><span class="comment">    /// node by thresholding at m_threshold. The &quot;negative&quot;</span></div>
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span><span class="comment">    /// cell, represented in the &quot;left&quot; sub-node, represents</span></div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span><span class="comment">    /// the space {x | funct(x) &lt; threshold}. The</span></div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span><span class="comment">    /// &quot;positive&quot; cell, represented by the &quot;right&quot;</span></div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span><span class="comment">    /// sub-node, represents {x | funct(x) &gt;= threshold}.</span></div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span><span class="comment">    /// The function needs to be normalized such that</span></div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span><span class="comment">    /// |f(x) - f(y)| is the distance between</span></div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span><span class="comment">    /// {z | f(z) = f(x)} and {z | f(z) = f(y)}, w.r.t.</span></div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span><span class="comment">    /// the distance function also used by the virtual</span></div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span><span class="comment">    /// function squaredDistanceLowerBound. The exact</span></div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span><span class="comment">    /// distance function does not matter as long as</span></div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span><span class="comment">    /// the same distance function is used in both cases.</span></div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#ad3bf9775a2e3122973a1b4036e8854fd">  305</a></span><span class="comment"></span>    <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code hl_function" href="classshark_1_1_binary_tree.html#ad3bf9775a2e3122973a1b4036e8854fd" title="Function describing the separation of space.">funct</a>(value_type <span class="keyword">const</span>&amp; point) <span class="keyword">const</span> = 0;</div>
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span><span class="comment"></span> </div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span><span class="comment">    /// \brief Split the data in the point list and calculate the treshold accordingly</span></div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span><span class="comment">    ///</span></div>
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span><span class="comment">    /// The method computes the optimal threshold given the distance of every element of</span></div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span><span class="comment">    /// the set and partitions the point range accordingly</span></div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span><span class="comment">    /// @param values the value of every point returned by funct(point)</span></div>
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span><span class="comment">    /// @param points the points themselves</span></div>
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span><span class="comment">    /// @returns returns the position were the point list was split</span></div>
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span><span class="comment"></span>    <span class="keyword">template</span>&lt;<span class="keyword">class</span> Range1, <span class="keyword">class</span> Range2&gt;</div>
<div class="foldopen" id="foldopen00315" data-start="{" data-end="}">
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a153a6ecae3dd8bf1407209962febca55">  315</a></span>    <span class="keyword">typename</span> Range2::iterator <a class="code hl_function" href="classshark_1_1_binary_tree.html#a153a6ecae3dd8bf1407209962febca55" title="Split the data in the point list and calculate the treshold accordingly.">splitList</a> (Range1&amp; values, Range2&amp; points){</div>
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>        std::vector&lt;KeyValuePair&lt;typename Range1::value_type, typename Range2::value_type&gt; &gt; range(values.size());</div>
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>        <span class="keywordflow">for</span>(std::size_t i = 0; i != range.size(); ++i){</div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>            range[i].key = values[i]; </div>
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>            range[i].value = points[i]; </div>
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>        }</div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>        </div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span> </div>
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>        <span class="keyword">auto</span> pos = <a class="code hl_function" href="namespaceshark.html#a49f0e3d033fc1a8bdd25083ed580743f" title="Partitions a range in two parts as equal in size as possible.">partitionEqually</a>(range);</div>
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>        <span class="keywordflow">for</span>(std::size_t i = 0; i != range.size(); ++i){</div>
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>            values[i] = range[i].key;</div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>            points[i] = range[i].value;</div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>        }</div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>        </div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>        <span class="keywordflow">if</span> (pos == range.end()) {</div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>            <span class="comment">// partitioning failed, all values are equal :(</span></div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>            <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a1d2b86563df35585acbbb0364d3a7450" title="threshold for the separating function">m_threshold</a> = values[0];</div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>            <span class="keywordflow">return</span> points.begin();</div>
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>        }</div>
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span> </div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>        <span class="comment">// We don&#39;t want the threshold to be the value of an element but always in between two of them.</span></div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>        <span class="comment">// This ensures that no point of the training set lies on the boundary. This leeds to more stable</span></div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>        <span class="comment">// results. So we use the mean of the found splitpoint and the nearest point on the other side</span></div>
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>        <span class="comment">// of the boundary.</span></div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>        <span class="keywordtype">double</span> maximum = std::max_element(range.begin(), pos)-&gt;key;</div>
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>        <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a1d2b86563df35585acbbb0364d3a7450" title="threshold for the separating function">m_threshold</a> = 0.5*(maximum + pos-&gt;key);</div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span> </div>
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>        <span class="keywordflow">return</span> points.begin() + (pos - range.begin());</div>
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>    }</div>
</div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span><span class="comment"></span> </div>
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span><span class="comment">    /// parent node</span></div>
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a100ef54d8a4904afff8c188bf4e735f9">  346</a></span><span class="comment"></span>    <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree</a>* <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a100ef54d8a4904afff8c188bf4e735f9" title="parent node">mep_parent</a>;</div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span><span class="comment"></span> </div>
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span><span class="comment">    /// &quot;left&quot; child node</span></div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0">  349</a></span><span class="comment"></span>    <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree</a>* <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0" title="&quot;left&quot; child node">mp_left</a>;</div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span><span class="comment"></span> </div>
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span><span class="comment">    /// &quot;right&quot; child node</span></div>
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#acc95bb731d3bfac4a896820f8de04ad8">  352</a></span><span class="comment"></span>    <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree</a>* <a class="code hl_variable" href="classshark_1_1_binary_tree.html#acc95bb731d3bfac4a896820f8de04ad8" title="&quot;right&quot; child node">mp_right</a>;</div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span><span class="comment"></span> </div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span><span class="comment">    /// list of indices to points in the dataset</span></div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#afdce442d41868d9a84dcfc954c78ce93">  355</a></span><span class="comment"></span>    std::size_t* <a class="code hl_variable" href="classshark_1_1_binary_tree.html#afdce442d41868d9a84dcfc954c78ce93" title="list of indices to points in the dataset">mp_indexList</a>;</div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span><span class="comment"></span> </div>
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span><span class="comment">    /// number of points in this node</span></div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a825e00e68228cb1654b5ac0a25f4972a">  358</a></span><span class="comment"></span>    std::size_t <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a>;</div>
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span><span class="comment"></span> </div>
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span><span class="comment">    /// number of nodes in the sub-tree represented by this node</span></div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#ad07d8f306001f8e1bc9a321a3d11444e">  361</a></span><span class="comment"></span>    std::size_t <a class="code hl_variable" href="classshark_1_1_binary_tree.html#ad07d8f306001f8e1bc9a321a3d11444e" title="number of nodes in the sub-tree represented by this node">m_nodes</a>;</div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span><span class="comment"></span> </div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span><span class="comment">    /// threshold for the separating function</span></div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"><a class="line" href="classshark_1_1_binary_tree.html#a1d2b86563df35585acbbb0364d3a7450">  364</a></span><span class="comment"></span>    <span class="keywordtype">double</span> <a class="code hl_variable" href="classshark_1_1_binary_tree.html#a1d2b86563df35585acbbb0364d3a7450" title="threshold for the separating function">m_threshold</a>;</div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span> </div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>};</div>
</div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span> </div>
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span> </div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>}</div>
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span><span class="preprocessor">#endif</span></div>
</div><!-- fragment --></div><!-- contents -->
</div>
</body>
</html>
